Corrigendum to: On a {K4, K2, 2, 2}-ultrahomogeneous graph
نویسنده
چکیده
The existence of a connected 12-regular {K4, K2,2,2}-ultrahomogeneous graph G is established, (i.e. each isomorphism between two copies of K4 or K2,2,2 in G extends to an automorphism of G), with the 42 ordered lines of the Fano plane taken as vertices. This graph G can be expressed in a unique way both as the edge-disjoint union of 42 induced copies of K4 and as the edge-disjoint union of 21 induced copies of K2,2,2, with no more copies of K4 or K2,2,2 existing in G. Moreover, each edge of G is shared by exactly one copy of K4 and one of K2,2,2. While the line graphs of d-cubes, (3 ≤ d ∈ ZZ), are {Kd, K2,2}-ultrahomogeneous, G is not even line-graphical. In addition, the chordless 6-cycles of G are seen to play an interesting role and some self-dual configurations associated to G with 2-arc-transitive, arc-transitive and semisymmetric Levi graphs are considered.
منابع مشابه
On K4-ultrahomogeneous and {K2s, Tts,t}K2-homogeneous graphs based on ordered pencils of binary projective spaces
Let C be a class of graphs. A definition of C-homogeneous graph G is given that fulfills the absence of a fitting generalization of C-ultrahomogeneous graph by considering each induced subgraph of G in C anchored by means of an arc. Let 2 < r ∈ Z, σ ∈ (0, r − 1) ∩ Z, t = 2 − 1 and s = 2. A construction of non-linegraphical connected {K2s, Tts,t}K2 -homogeneous graphs G (meaning C = {K2s, Tts,t}...
متن کاملConstructing {K2s, Tts,t}K2-Homogeneous Graphs with Pencils
Let C be a class of graphs. A restricted concept of C-homogeneous graphs generalizing the C-ultrahomogeneous graphs of [5] is given. Subsequently, a construction of non-line-graphical {K2s, Tts,t}K2 homogeneous graphs that includes the {K4, K2,2,2}K2 -ultrahomogeneous graph of [2], by means of ordered pencils of binary projective spaces, is shown to yield 20 such graphs that are not {K2s, Tts,t...
متن کاملOn a Biggs-Smith self-dual (1024)-configuration
A construction based on the Biggs-Smith graph is shown to produce an edge-disjoint union of 102 copies of K4 forming a {K4, L(Q3)}K3 -ultrahomogeneous graph dressed as the non-line-graphical Menger graph of a self-dual (1024)-configuration. This stands in contrast to the selfdual (424)-configuration of [8], whose Menger graph is a non-line-graphical {K4, K2,2,2}K2 -ultrahomogeneous graph.
متن کاملOn K4-ultrahomogeneous and related graphs based on pencils of binary projective spaces
Let C be a class of graphs. A definition of C-homogeneous graph G is given that fulfills the absence of a fitting generalization of C-ultrahomogeneous graph by considering each induced subgraph of G in C anchored by an arc. Let 2 < r ∈ Z, σ ∈ (0, r − 1) ∩ Z, t = 2 − 1 and s = 2. A construction of non-line-graphical connected {K2s, Tts,t}K2 -homogeneous graphs G (meaning C = {K2s, Tts,t} with ea...
متن کاملOn C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 46 شماره
صفحات -
تاریخ انتشار 2010